DC approximation approaches for sparse optimization
نویسندگان
چکیده
منابع مشابه
DC approximation approaches for sparse optimization
Sparse optimization refers to an optimization problem involving the zero-norm in objective or constraints. In this paper, nonconvex approximation approaches for sparse optimization have been studied with a unifying point of view in DC (Difference of Convex functions) programming framework. Considering a common DC approximation of the zero-norm including all standard sparse inducing penalty func...
متن کاملHardness of Approximation for Sparse Optimization with L0 Norm
In this paper, we consider sparse optimization problems with L0 norm penalty or constraint. We prove that it is strongly NP-hard to find an approximate optimal solution within certain error bound, unless P = NP. This provides a lower bound for the approximation error of any deterministic polynomialtime algorithm. Applying the complexity result to sparse linear regression reveals a gap between c...
متن کامل119 abstract «research note» measuring the abilities of four approximation approaches for trusses optimization
there are a lot of approximation techniques for structural optimization. among them, four outstanding approximation methods have been selected for trusses optimization. these approaches have been developed or modified by previous ones. based on these schemes, a lot of trusses have been optimized by author's program. this study shows that the abilities of the mentioned methods are not the s...
متن کاملLearning Sparse Dictionaries for Sparse Signal Approximation
An efficient and flexible dictionary structure is proposed for sparse and redundant signal representation. The structure is based on a sparsity model of the dictionary atoms over a base dictionary. The sparse dictionary provides efficient forward and adjoint operators, has a compact representation, and can be effectively trained from given example data. In this, the sparse structure bridges the...
متن کاملSurface approximation via sparse representation and parameterization optimization
Surface approximation with smooth functions suffers the problems of choosing the basis functions and representing non-smooth features. In this work, we introduce a sparse representation for surfaces with a set of redundant basis functions, which efficiently overcomes the overfitting artifacts. Moreover, we propose an approach of parameterization transformation, which makes the possibility to re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2015
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2014.11.031